Hyperplane arrangements and Lefschetz's hyperplane section theorem
نویسندگان
چکیده
منابع مشابه
A Combinatorial Reciprocity Theorem for Hyperplane Arrangements
Given a nonnegative integer m and a finite collection A of linear forms on Qd, the arrangement of affine hyperplanes in Qd defined by the equations α(x) = k for α ∈ A and integers k ∈ [−m,m] is denoted by Am. It is proved that the coefficients of the characteristic polynomial of Am are quasi-polynomials inm and that they satisfy a simple combinatorial reciprocity law.
متن کاملRandom Walk and Hyperplane Arrangements
Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...
متن کاملBranched Polymers and Hyperplane Arrangements
We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie [BI], and Kenyon and Winkler [KW] to any hyperplane arrangement A. The volume of the resulting configuration space of connected branched polymers associated to the hyperplane arrangement A is expressed through the value of the chara...
متن کاملComplex Hyperplane Arrangements
We were fortunate to spend the 2004 fall semester in residence at MSRI, participating in the program on Hyperplane Arrangements and Applications. It was an intense, stimulating, productive, enlightening, eventful and most enjoyable experience. It was especially so for us long-timers in the field because the program truly marked a coming-of-age in the evolution of the subject from relative obscu...
متن کاملArtin groups and hyperplane arrangements
These are the notes of a mini-course given at the conference “Arrangements in Pyrénées”, held in Pau (France) from 11th to 15th of June, 2012. Definition. Let S be a finite set. A Coxeter matrix on S is a square matrix M = (ms,t)s,t∈S indexed by the elements of S and satisfying: (a) ms,s = 1 for all s ∈ S; (b) ms,t = mt,s ∈ {2, 3, 4, . . . } ∪ {∞} for all s, t ∈ S, s 6= t. A Coxeter matrix is u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kodai Mathematical Journal
سال: 2007
ISSN: 0386-5991
DOI: 10.2996/kmj/1183475510